The Least Squares Solution with the Minimal Norm to a System of Mixed Generalized Sylvester Reduced Biquaternion Tensor Equations
نویسندگان
چکیده
In this paper, we investigate the least squares solution with minimal norm to system (1.1) over reduced biquaternion via complex representation of tensors and Moore–Penrose inverse tensors. Besides, establish some necessary sufficient conditions for solvability above give an expression general when are met. Moreover, algorithm numerical example presented verify main results paper.
منابع مشابه
On the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملLeast-Squares Approximate Solution of Overdetermined Sylvester Equations
We address the problem of computing a low-rank estimate Y of the solution X of the Lyapunov equation AX + XA′ + Q = 0 without computing the matrix X itself. This problem has applications in both the reduced-order modeling and the control of large dimensional systems as well as in a hybrid algorithm for the rapid numerical solution of the Lyapunov equation via the alternating direction implicit ...
متن کاملon the numerical solution of generalized sylvester matrix equations
the global fom and gmres algorithms are among the effective methods to solve sylvester matrix equations. in this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two cg-type algorithms for solving generalized sylvester matrix equations. the proposed methods are iterative projection metho...
متن کاملIterative least-squares solutions of coupled Sylvester matrix equations
In this paper, we present a general family of iterative methods to solve linear equations, which includes the well-known Jacobi and Gauss–Seidel iterations as its special cases. The methods are extended to solve coupled Sylvester matrix equations. In our approach, we regard the unknown matrices to be solved as the system parameters to be identified, and propose a least-squares iterative algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2023
ISSN: ['1027-5487', '2224-6851']
DOI: https://doi.org/10.11650/tjm/220901